A Well-Characterized Approximation Problem

We consider the following NP optimization problem: Given a set of polynomials Pi(x), i = 1 : : : s of degree at most 2 over GF [p] in n variables, nd a root common to as many as possible of the polynomials Pi(x). We prove that in the case when the polynomials do not contain any squares as monomials, it is always possible to approximate this problem within a factor of p 2 p 1 in polynomial time for xed p. This follows from the stronger statement that one can, in polynomial time, nd an assignment that satis es at least p 1 p of the nontrivial equations. More interestingly, we prove that approximating the maximal number of polynomials with a common root to within a factor of p is NPhard. This implies that the ratio between the performance of the approximation algorithm and the impossibility result is essentially p p 1 which can be made arbitrarily close to 1 by choosing p large. We also prove that for any constant < 1, it is NP-hard to approximate the solution of quadratic equations over the rational numbers, or over the reals, within n . Warning: Essentially this paper has been published in Information Processing Letters and is hence subject to copyright restrictions. It is for personal use only. Partially supported by NSF Grant CCR-9010517 and grants from Mitsubishi and OTL.